Section: New Software and Platforms

Abella

Participants : Kaustuv Chaudhuri [correspondant] , Matteo Cimini [Indiana University] , Dale Miller, Olivier Savary-Bélanger [Princeton University] , Mary Southern [University of Minnesota] , Yuting Wang [University of Minnesota] .

Main web-site: http://abella-prover.org .

Abella is an interactive theorem prover for reasoning about data structures with binding constructs using the $\lambda$-tree approach to syntax. It consists of a sophisticated reasoning logic that supports induction, co-induction, and generic reasoning. Abella also supports the two-level logic approach by means of a specification logic based on the logic programming language $\lambda$Prolog.

In 2014, the following additions were made to the system.

• A new translation layer was added to Abella's specification layer, which was used to build an interface to the LF dependent type theory  [61] . This extension was documented in the following paper: [27] . A number of examples of the use of this new specification language are available at the following URL: http://abella-prover.org/lf

• Two minor releases were made, versions 2.0.2 and 2.0.3, that fixed a number of bugs and added several convenience features. Consult the change log for more details.

Accompanying these additions were the following publications.

• A new comprehensive tutorial for the Abella system has been accept to appear in the Journal of Formalized Reasoning [31] .

• The new tactical plugin architecture and the dynamic contexts plugin of Abella in the following paper: [26] .

• The use of co-induction and higher-order relations to formalize the meta-theory of various bisimulation-up-to techniques for common process calculi: [19] .